On fairness of D0L systems
نویسنده
چکیده
Aword is called fair if it contains, for each pair of distinct symbols a, b, the same number of occurrences of the scattered subword ab as of ba. We prove that if the first k + 1 words in the sequence generated by a D0L system over a k-letter alphabet are fair then all words in the sequence are fair. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Bispecial factors in circular non-pushy D0L languages
We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method of how to find all bispecial words of non-pushy circular D0L-systems. This method can be formulated as an algorithm. Moreover, we prove that non-pushy circular D0L-systems are exactly those with finite critical exponent. keywords: bispecial factors, circular D0L systems, non-pushy D0L systems, cri...
متن کاملThe Equivalence Problem for DF0L Languages and Power Series
The theory of free monoids lies at the crossroads of mathematics and theoretical computer science. Many problems studied in free monoid theory have their origins in theoretical computer science. On the other hand, their solutions often require deep methods from classical mathematics. D0L systems constitute a very natural framework for studying free monoid morphisms and their iterations. Infinit...
متن کاملUni-transitional Watson-crick D0l Systems Uni-transitional Watson-crick D0l Systems
The phenomenon known as Watson-Crick complementarity is basic both in the experiments and theory of DNA computing. While the massive parallelism of DNA strands makes exhaustive searches possible, complementarity constitutes a powerful computational tool. It is also very fruitful to view complementarity as a language-theoretic operation: \bad" words obtained through a generative process are repl...
متن کاملParallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers
We improve several upper bounds to the complexity of the membership problem for languages deened by iterated morphisms (D0L systems). The complexity bounds are expressed in terms of DLOGT IME-uniform circuit families. We prove: 1) For polynomially growing D0L systems the membership problem is contained in AC 0. 2) For arbitrary D0L systems the membership problem is contained in NC 1. 3) The lat...
متن کاملWatson-Crick D0L Systems
D0L systems constitute the simplest and most widely studied type of Lindenmayer systems. They have the remarkable property of generating their language as a (word) sequence and, consequently, are very suitable for modeling growth properties. In this paper a new type of D0L systems is introduced, where the parallelism presented in L systems is combined with the paradigm of (Watson-Crick) complem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 155 شماره
صفحات -
تاریخ انتشار 2007